import java.util.Comparator;


public class PQDelegator<V extends Vertex<V>> implements DataStructure<V>{
	private java.util.PriorityQueue<Path<V>> queue;
	
	public PQDelegator(Comparator<Path<V>> comp)
	{
		queue = new java.util.PriorityQueue<Path<V>>(1,comp);
	}
	
	public java.util.PriorityQueue<Path<V>> getQueue() {
		return queue;
	}

	public void setQueue(java.util.PriorityQueue<Path<V>> queue) {
		this.queue = queue;
	}

	@Override
	public void add(Path<V> path) {
		queue.add(path);
		
	}

	@Override
	public Path<V> remove() {
		return queue.remove();
	}

	@Override
	public boolean isEmpty() {
		return queue.isEmpty();
	}
}
